I/O efficient ECC graph decomposition via graph reduction
نویسندگان
چکیده
منابع مشابه
Efficient clique decomposition of a graph into its atom graph
We explain how to organize the atoms resulting from clique minimal separator decomposition into a metagraph which we call the atom graph, and give an efficient recursive algorithm to compute this graph at no extra cost than computing the atoms.
متن کاملtoeplitz graph decomposition
let $n,t_1,...,t_k$ be distinct positive integers. a toeplitz graph $g=(v, e)$ denoted by $t_n$ is a graph, where $v ={1,...,n}$ and $e= {(i,j) : |i-j| in {t_1,...,t_k}}$.in this paper, we present some results on decomposition of toeplitz graphs.
متن کاملEfficient Graph Packing via Game Colouring
The game colouring number gcol(G) of a graph G is the least k such that, if two players take turns choosing the vertices of a graph, then either of them can ensure that every vertex has fewer than k neighbours chosen before it, regardless of what choices the other player makes. Clearly gcol(G) Δ(G) + 1. Sauer and Spencer [20] proved that if two graphs G1 and G2 on n vertices satisfy 2Δ(G1)Δ(G2)...
متن کاملEfficient Shape Matching Via Graph Cuts
Meaningful notions of distance between planar shapes typically involve the computation of a correspondence between points on one shape and points on the other. To determine an optimal correspondence is a computationally challenging combinatorial problem. Traditionally it has been formulated as a shortest path problem which can be solved efficiently by Dynamic Time Warping. In this paper, we sho...
متن کاملEfficient Graph Packing via Game Coloring
The game coloring number gcol(G) of a graph G is the least k such that if two players take turns choosing the vertices of a graph then either of them can insure that every vertex has less than k neighbors chosen before it, regardless of what choices the other player makes. Clearly gcol(G) ≤ ∆(G) + 1. Sauer and Spencer [20] proved that if two graphs G1 and G2 on n vertices satisfy 2∆(G1)∆(G2) < ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The VLDB Journal
سال: 2016
ISSN: 1066-8888,0949-877X
DOI: 10.1007/s00778-016-0451-4